Quantum Query Complexity of Multilinear Identity Testing
نویسندگان
چکیده
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an additive generating set and a multilinear polynomial over that ring, also accessed as a black-box function (we allow the indeterminates of the polynomial to be commuting or noncommuting), we study the problem of testing if the polynomial is an identity for the given ring. We give a quantum algorithm with query complexity sub-linear in the number of generators for the ring, when the number of indeterminates of the input polynomial is small (ideally a constant). Towards a lower bound, we also show a reduction from a version of the collision problem (which is well studied in quantum computation) to a variant of this problem.
منابع مشابه
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality
We show an equivalence between 1-query quantum algorithms and representations by degree2 polynomials. Namely, a partial Boolean function f is computable by a 1-query quantum algorithm with error bounded by ǫ < 1/2 iff f can be approximated by a degree-2 polynomial with error bounded by ǫ < 1/2. This result holds for two different notions of approximation by a polynomial: the standard definition...
متن کاملBlack Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in
In this paper we consider the problem of determining whether an unknown arithmetic circuit, for which we have oracle access, computes the identically zero polynomial. Our focus is on depth-3 circuits with a bounded top fan-in. We obtain the following results. 1. A quasi-polynomial time deterministic black-box identity testing algorithm for ΣΠΣ(k) circuits (depth-3 circuits with top fan-in equal...
متن کاملOn the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynomial decomposition problem is defined to be the task of finding the indecomposable factors of a given polynomial. Note that for multilinear polynomials, factorization is the same as decomposition, as any two different fa...
متن کاملThe Quantum Query Complexity of Algebraic Properties
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or has an identity element. If S is a monoid, we want to decide whether S is a group. We present quantum algorithms for these problems that improve the best known classical complexity bounds. In particular, we give the fi...
متن کاملThe quantum query complexity of learning multilinear polynomials
In this note we study the number of quantum queries required to identify an unknown multilinear polynomial of degree d in n variables over a finite field Fq. Any bounded-error classical algorithm for this task requires Ω(n) queries to the polynomial. We give an exact quantum algorithm that uses O(nd−1) queries for constant d, which is optimal. In the case q = 2, this gives a quantum algorithm t...
متن کامل